Large sets of Hamilton cycle decompositions of complete bipartite graphs
نویسندگان
چکیده
منابع مشابه
Mixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملHamilton decompositions of line graphs of some bipartite graphs
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to have Hamilton decomposable line graphs. One consequence is that every bipartite Hamilton decomposable graph G with connectivity κ(G) = 2 has a Hamilton decomposable line graph L(G).
متن کاملSymmetric Hamilton cycle decompositions of complete multigraphs
Let n ≥ 3 and λ ≥ 1 be integers. Let λKn denote the complete multigraph with edge-multiplicity λ. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of λK2m for all even λ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of λK2m − F for all odd λ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki...
متن کاملFair Hamilton Decompositions of Complete Multipartite Graphs
A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H1 and H2, the difference in the number of edges in H1 and H2 joining vertices in these two parts is at most one. In this paper we completely settle the existence of such decomposi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.06.011